منابع مشابه
Greedy concepts for network flow problems
A directed graph G = ( V , E ) is given by a finite vertex set V and an edge set E C V× V. We choose two distinct vertices s e Vand t~ Vthat we consider as source and sink respectively. A path (from s to t) is a sequence of distinct edges (s, xl ), (xl, Xz) . . . . . (Xrj, Xr), (Xr, t) for some r. Denote by P the set of all such paths. For an edge e e E let PeCP be the set of paths passing thro...
متن کاملMulticommodity Network Flow Problems
In this paper, we consider to apply a primal-dual proximal point algorithm to the multicommodity network flow problem. A remarkable feature of the algorithm consists in how to find an approximate saddle point of the augmented Lagrangian of the problem. In particular, at each iteration, an approximate solution of the subproblem always satisfies the flow conservation equations for all commodities...
متن کاملCombinatorial algorithms for inverse network flow problems
An inverse optimization problems is defined as follows: Let S denote the set of feasible solutions of an optimization problem P, let c be a specified cost vector, and xO be a given feasible solution. We want to perturb the cost vector c to d so that x is an optimal solution of P with respect to the cost vector d , and lid clip is minimum, where 11.llp denotes some selected Lp norm. In this pape...
متن کاملUncertain Dynamic Network Flow Problems
In this paper, uncertain dynamic network flow problems (UDNFPs) are formulated, and an algorithm is proposed to solve them by noting that arc capacities are uncertain (may vary with time or not), and flow varies over time in each arc. Here, uncertainty refers to nondeterministic states, in which some factors are uncertain and cannot be determined by the probability theory. Since the uncertainty...
متن کاملIntroduction to Network Flow Problems
1 Basic definitions and properties Definition 1.1. A flow network is a directed graph D = (V,E) with two distinguished vertices s and t called the source and the sink, respectively. Moreover, each arc (u, v) ∈ E has a certain capacity c(u, v) ≥ 0 assigned to it. If (u, v) / ∈ E (including pairs of the form (u, u)), we assume c(u, v) = 0. In this note, we shall restrict ourselves to the case whe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1986
ISSN: 0166-218X
DOI: 10.1016/0166-218x(86)90037-5